A PROOF OF GEORGE ANDREWS’ AND DAVID ROBBINS’ q-TSPP CONJECTURE
نویسندگان
چکیده
The conjecture that the orbit-counting generating function for totally symmetric plane partitions can be written as an explicit product-formula, has been stated independently by George Andrews and David Robbins around 1983. We present a proof of this long-standing conjecture.
منابع مشابه
Plane Partitions Vi: Stembridge’s Tspp Theorem
We provide a new proof of Stembridge’s theorem which validated the Totally Symmetric Plane Partitions (TSPP) Conjecture. The overall strategy of our proof follows the same general pattern of determinant evaluation as discussed by the first named author in a series of papers. The resulting hypergeometric multiple sum identities turn out to be quite complicated. Their correctness is proved by app...
متن کاملProof of George Andrews's and David Robbins's q-TSPP Conjecture
1 Proemium In the historical conference Combinatoire Énumerative that took place at the end of May 1985 in Montréal, Richard Stanley raised some intriguing problems about the enumeration of plane partitions (see below), which he later expanded into a fascinating article [11]. Most of these problems concerned the enumeration of “symmetry classes” of plane partitions that were discussed in more d...
متن کاملElementary Proof of MacMahon’s Conjecture
Major Percy A. MacMahon’s first paper on plane partitions [4] included a conjectured generating function for symmetric plane partitions. This conjecture was proven almost simultaneously by George Andrews and Ian Macdonald, Andrews using the machinery of basic hypergeometric series [1] and Macdonald employing his knowledge of symmetric functions [3]. The purpose of this paper is to simplify Macd...
متن کامل1 D ec 1 99 7 ELEMENTARY PROOF OF MACMAHON ’ S CONJECTURE
Abstract. Major Percy A. MacMahon’s first paper on plane partitions [4] included a conjectured generating function for symmetric plane partitions. This conjecture was proven almost simultaneously by George Andrews and Ian Macdonald, Andrews using the machinery of basic hypergeometric series [1] and Macdonald employing his knowledge of symmetric functions [3]. The purpose of this paper is to sim...
متن کاملAlternating Sign Matrices and Descending Plane Partitions
An alternating sign matrix is a square matrix such that (i) all entries are 1,-1, or 0, (ii) every row and column has sum 1, and (iii) in every row and column the nonzero entries alternate in sign. Striking numerical evidence of a connection between these matrices and the descending plane partitions introduced by Andrews (Invent. Math. 53 (1979), 193-225) have been discovered, but attempts to p...
متن کامل